A generalization of the Erlang ’ s B formula

نویسندگان

  • A. LAMBROS
  • A. POMBORTSIS
  • A. SIDERIDIS
  • D. TAMBOURATZIS
چکیده

In the present paper a generalization of the Erlang's B formula is proposée, for a loss System in which arriving calls follow a Poisson process. The holding time of each call follows a négative exponential distribution. The application of the results obtained can be used for the improvement of the grade of service, the efficient use o f the existing equipment and the appropriate tariff policy and technical planning of the networks. To evaluate the parameters included in the proposed generalized Erlang's B formula real telexdata taken from the Salonica local area xvere used.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Unified Method to Analyze Overtake Free Queueing Systems

In this paper we demonstrate that the distributional laws that relate the number of customers in the system (queue), L(Q) and the time a customer spends in the system (queue), S(W) under the first-in-first-out (FIFO) discipline are special cases of the H = AG law and lead to a complete solution for the distributions of L, Q, S, W for queueing systems which satisfy distributional aws for both L ...

متن کامل

Asymptotic Inversion of the Erlang B Formula

The Erlang B formula represents the steady-state blocking probability in the Erlang loss model or M/M/s/s queue. We derive asymptotic expansions for the offered load that matches, for a given number of servers, a certain blocking probability. In addressing this inversion problem we make use of various asymptotic expansions for the incomplete gamma function. A similar inversion problem is invest...

متن کامل

Hd28 .m414 No . Working Paper Alfred P. Sloan School of Management a Unified Method to Analyze Overtake Free Queueing Systems a Unified Method to Analyze Overtake Free Queueing Systems a Unified Method to Analyze Overtake Free Queueing Systems

In this paper we demonstrate that the distributional laws that relate the number of customers in the system (queue), L (<?) and the time a customer spends in the system (queue), S (W) under the first-in-first-out (FIFO) discipline lead to a complete solution for the distributions of L, Q, S, W for queueing systems which satisfy distributional laws for both L and Q {overtake free systems). Moreo...

متن کامل

A lower bound for the Erlang C formula in the Halfin-Whitt regime

One of the classical models of queueing theory is the M/M/s queue or Erlang delay model. This model has s homogeneous servers working in parallel. Customers arrive according to a Poisson process with arrival rate λ, and the service times are independent and exponentially distributed with mean 1/μ. Let the offered load be a = λ/μ and assume a < s to have a proper steady-state distribution. The m...

متن کامل

Decomposition of H*-Algebra Valued Negative Definite Functions on Topological *-Semigroups

In the present paper, among other results, a decomposition formula is given for the w-bounded continuous negative definite functions of a topological *-semigroup S with a weight function w into a proper H*-algebra A in terms of w-bounded continuous positive definite A-valued functions on S. A generalization of a well-known result of K. Harzallah is obtained. An earlier conjecture of the author ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017